Genetic Algorithm for Constrained Optimization with Stepwise Approach in Search Interval Selection of Variables

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Particle Swarm Optimization and Genetic Algorithm for Truss Structures with Discrete Variables

A new hybrid algorithm of Particle Swarm Optimization and Genetic Algorithm (PSOGA) is presented to get the optimum design of truss structures with discrete design variables. The objective function chosen in this paper is the total weight of the truss structure, which depends on upper and lower bounds in the form of stress and displacement limits. The Particle Swarm Optimization basically model...

متن کامل

Simple and Constrained Selection Indices with and without Calving Interval Included in Selection Goal Function for Holstein Cows of Iran

Two selection goals of inclusion or exclusion of calving interval (CI) in the selection goal function for Holstein cows in Iran, besides milk yield, milk fat percentage, and milk protein percentage, were studied. Four selection indices were composed of using the information on production traits, CI and / or days from calving to first insemination (DFI). The results of the predicted genetic grow...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

An Alternative Approach for PDE-Constrained Optimization via Genetic Algorithm

This paper deals with an alternative approach for solving the PDE-constrained optimization problems. For this purpose, the problem has been discretized with the help of finite difference method. Then the reduced problem has been solved by advanced real coded genetic algorithm with ranking selection, whole-arithmetic crossover and non uniform mutation. The proposed approach has been illustrated ...

متن کامل

An Adaptive Penalty Approach for Constrained Genetic-Algorithm Optimization

In this paper we describe a new adaptive penalty approach for handling constraints in genetic algorithm optimization problems. The idea is to start with a relatively small penalty coefficient and then increase it or decrease it on demand as the optimization progresses. Empirical results in several engineering design domains demonstrate the merit of the proposed approach.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2014

ISSN: 0975-8887

DOI: 10.5120/15256-4017